Advances in LTL load plan design
نویسنده
چکیده
منابع مشابه
Improved Load Plan Design Through Integer Programming Based Local Search
We present advances both in modeling and algorithm design for a service network design problem faced by less-than-truckload (LTL) freight transportation carriers. The developed models more accurately capture key operations of today’s carriers: decisions for loaded and empty trailer movements are considered simultaneously, and a time discretization is used that can appropriately model the timing...
متن کاملRefined Execution Cost Estimation for LTL Load Plans
A load plan specifies how freight is routed through a linehaul terminal network operated by a less-than-truckload (LTL) motor carrier. Determining the design of the load plan, a problem of service network design, is critical to effective operations of such carriers. Operations research techniques currently support load plan design, and all models in use or proposed today approximate transportat...
متن کاملExtended LTLvis Motion Planning interface (Extended Technical Report)
This paper introduces a graphical interface for Linear Temporal Logic (LTL) specifications for mobile robots. It is a sketch based interface built on the Android platform which makes the LTL control interface more friendly to non-expert users. By predefining a set of areas of interest, this interface can quickly and efficiently create plans that satisfy extended plan goals in LTL. The interface...
متن کاملHierarchical decomposition of LTL synthesis problem for mixed-monotone control systems
This paper deals with the control synthesis problem for a continuous nonlinear dynamical system under a Linear Temporal Logic (LTL) formula. The proposed solution is a topdown hierarchical decomposition of the control problem involving three abstraction layers of the problem, iteratively solved from the coarsest to the finest. The LTL planning is first solved on a small transition system only d...
متن کاملSafe LTL Assumption-Based Planning
Planning for partially observable, nondeterministic domains is a very significant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal dynamics of the domain; using them to constrain the search may lead to dramatically improve the efficiency in plan generation. In turn, the execution of assumption-based plans must be monitored to prevent runtime fai...
متن کامل